- modular calculation
- вычисления по модулю (целого числа), модулярные (модульные) вычисления
Англо-русский словарь по компьютерной безопасности. Академик.ру. 2011.
modular calculation
Смотреть что такое "modular calculation" в других словарях:
Étale cohomology — In mathematics, the étale cohomology groups of an algebraic variety or scheme are algebraic analogues of the usual cohomology groups with finite coefficients of a topological space, introduced by Grothendieck in order to prove the Weil… … Wikipedia
Multiplication algorithm — A multiplication algorithm is an algorithm (or method) to multiply two numbers. Depending on the size of the numbers, different algorithms are in use. Efficient multiplication algorithms have existed since the advent of the decimal system.… … Wikipedia
Exponentiation by squaring — Exponentiating by squaring is an algorithm used for the fast computation of large integer powers of a number. It is also known as the square and multiply algorithm or binary exponentiation. In additive groups the appropriate name is double and… … Wikipedia
Numerical digit — The ten digits of the Arabic numerals, in order of value. A digit is a symbol (a numeral symbol such as 3 or 7 ) used in combinations (such as 37 ) to represent numbers in positional numeral systems. The name digit comes from the fact that the 10 … Wikipedia
History of computing hardware — Computing hardware is a platform for information processing (block diagram) The history of computing hardware is the record of the ongoing effort to make computer hardware faster, cheaper, and capable of storing more data. Computing hardware… … Wikipedia
MIM-104 Patriot — Patriot system of the German Luftwaffe Type Mobile Surface to air missile system Place of … Wikipedia
International Standard Book Number — ISBN redirects here. For usage of ISBNs in Wikipedia, see Wikipedia:ISBN. A 13 digit ISBN, 978 3 16 148410 0, as represented by an EAN 13 bar code. The International Standard Book Number (ISBN) is a unique[1][2 … Wikipedia
Montgomery reduction — In arithmetic computation, Montgomery reduction is an algorithm introduced in 1985 by Peter Montgomery that allows modular arithmetic to be performed efficiently when the modulus is large (typically several hundred bits). A single application of… … Wikipedia
Congruence subgroup — In mathematics, a congruence subgroup of a matrix group with integer entries is a subgroup defined by congruence conditions on the entries. A very simple example would be invertible 2x2 integer matrices of determinant 1, such that the off… … Wikipedia
List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… … Wikipedia
Pi — This article is about the number. For the Greek letter, see Pi (letter). For other uses, see Pi (disambiguation). The circumference of a ci … Wikipedia
